Automatically comparing memory consistency models

De ning and Comparing Memory Consistency Models

Because multiprocessors implement sophisticated memory structures in order to enhance performance, processes can have inconsistent views of memory which may result in unexpected program outcomes. A memory consistency model is a set of guarantees that describes constraints on the outcome of sequences of in-terleaved and simultaneous operations in a multipro-cessor. In this paper, we present a un...

Weak Memory Consistency Models

Process coordination problems have been extensively addressed in the context of sequential consistency. However, modern multiprocessors present a large variety of memory models that are anything but sequentially consistent. In these machines, the ordering constraints on memory accesses are few. We re-address two fundamental process coordination problems in the context of weak memory models. We ...

Memory Models Discussion Sequential Consistency

In the context of shared-memory systems, the memory model specifies the values that a shared-memory read in a program may return. It is part of the interface between a shared-memory program and any hardware or software that may transform that program – it specifies both the possible behaviors of the memory accesses for the programmer and constrains the legal transformations and executions for t...

Comparing indoor and outdoor network models for automatically calculating turns

Cross-Collection Topic Models: Automatically Comparing and Contrasting Text

This paper describes cross-collection latent Dirichlet allocation (ccLDA), a probabilistic topic model that captures meaningful word co-occurrences across multiple text collections. The model is applied to three different applications: discovering cultural differences in blogs and forums from different countries, discovering research topics across multiple scientific disciplines, and comparing ...